Genetic Algorithm-based Hybrid Methods for a Flexible Single-operation Serial-batch Scheduling Problem with Mold Constraints

Scheduling in a manufacturing system is currently a research hotspot. This paper proposes a flexible, single-operation, serial-batch scheduling problem with mold constraints that arise from injection molding production. In such a scheduling problem, three decision problems exist: product batch splitting, sequencing, and resource selection. A divide-and-conquer framework is introduced to solve the three decision problems. A hybrid algorithm combining the genetic algorithm for sequencing with the heuristic algorithm for resource selection is developed. We design an experimental case to which the corresponding simulation scheduling process is applied. We present a detailed analysis of the simulation results, which indicate that the solution framework and the hybrid algorithm are effective. Copyright © 2013 IFSA.